Leveraging Higher Order Dependencies between Features for Text Classification.

A Higher Order Collective Classifier for detecting and classifying network events.

Data transformations and representations for computation and visualization.

Science of analytical reasoning.

Data transformations and representations for computation and visualization.

D%2DHOTM distributed higher order text mining.

Mining Higher%2DOrder Association Rules from Distributed Named Entity Databases.

NSF%2DDGE GK%2D12 teaching fellowships changing student perceptions about computer science.

Distributed higher%2Dorder text mining theory and practice.

Detection of Interdomain Routing Anomalies Based on Higher%2DOrder Path Analysis.

A framework for understanding Latent Semantic Indexing %28LSI%29 performance.
In this paper we present a theoretical model for understanding the performance of Latent Semantic Indexing (LSI) search and retrieval applications. Many models for understanding LSI have been proposed. Ours is the first to study the values produced by LSI in the term dimension vectors. The framework presented here is based on term co-occurrence data. We show a strong correlation between second order term co-occurrence and the values produced by the Singular Value Decomposition (SVD) algorithm that forms the foundation for LSI. We also present a mathematical proof that the SVD algorithm encapsulates term co-occurrence information.
Hardware%2Dbased support vector machine classification in logarithmic number systems.

Posting Act Tagging Using Transformation%2DBased Learning.
In this article we present the application of transformation-based learning (TBL) [1] to the task of assigning tags to postings in online chat conversations. We define a list of posting tags that have proven useful in chat-conversation analysis. We describe the templates used for posting act tagging in the context of template selection. We extend traditional approaches used in part-of-speech tagging and dialogue act tagging by incorporating regular expressions into our templates. We close with a presentation of results that compare favorably with the application of TBL in dialogue act tagging.
Identification of Critical Values in Latent Semantic Indexing.
This paper reports the results of a study to determine the most critical elements of the T k and S k D k matrices, which are input to LSI. We are interested in the impact, both in terms of retrieval quality and query run time performance, of the removal (zeroing) of a large portion of the entries in these matrices
Identification of Critical Values in Latent Semantic Indexing.
This paper reports the results of a study to determine the most critical elements of the T k and S k D k matrices, which are input to LSI. We are interested in the impact, both in terms of retrieval quality and query run time performance, of the removal (zeroing) of a large portion of the entries in these matrices
Application Resource Requirement Estimation in a Parallel%2DPipeline Model of Execution.

A semi%2Dsupervised active learning algorithm for information extraction from textual data.
this article we present a semi-supervised active learning algorithm for pattern discovery in information extraction from textual data. The patterns are reduced regular expressions composed of various characteristics of features useful in information extraction. Our major contribution is a semi-supervised learning algorithm that extracts information from a set of examples labeled as relevant or irrelevant to a given attribute. The approach is semi-supervised because it does not require precise labeling of the exact location of features in the training data. This significantly reduces the effort needed to develop a training set. An active learning algorithm is used to assist the semi-supervised learning algorithm in order to further reduce training set development effort. The active learning algorithm is seeded with a single positive example of a given attribute. The context of the seed is used to automatically identify candidates for additional positive examples of the given attribute. Candidate examples are manually pruned during the active learning phase, and our semi-supervised learning algorithm automatically discovers reduced regular expressions for each attribute. We have successfully applied this learning technique in the extraction of textual features from police incident reports, university crime reports, and patents. The performance of our algorithm compares favorably with competitive extraction systems being used in criminal justice information systems
Distributed higher order association rule mining using information extracted from textual data.
The burgeoning amount of textual data in distributed sources combined with the obstacles involved in creating and maintaining central repositories motivates the need for effective distributed information extraction and mining techniques. Recently, as the need to mine patterns across distributed databases has grown, Distributed Association Rule Mining (D-ARM) algorithms have been developed. These algorithms, however, assume that the databases are either horizontally or vertically distributed. In the special case of databases populated from information extracted from textual data, existing D-ARM algorithms cannot discover rules based on higher-order associations between items in distributed textual documents that are neither vertically nor horizontally distributed, but rather a hybrid of the two. In this article we present D-HOTM, a framework for Distributed Higher Order Text Mining. D-HOTM is a hybrid approach that combines information extraction and distributed data mining. We employ a novel information extraction technique to extract meaningful entities from unstructured text in a distributed environment. The information extracted is stored in local databases and a mapping function is applied to identify globally unique keys. Based on the extracted information, a novel distributed association rule mining algorithm is applied to discover higher-order associations between items (i.e., entities) in records fragmented across the distributed databases using the keys. Unlike existing algorithms, D-HOTM requires neither knowledge of a global schema nor that the distribution of data be horizontal or vertical. Evaluation methods are proposed to incorporate the performance of the mapping function into the traditional support metric used in ARM evaluation. An example application of the algorithm on distributed law enforcement data demonstrates the relevance of D-HOTM in the fight against terrorism. Keywords Distributed data mining, distributed association rule mining, knowledge discovery, artificial intelligence, machine learning, data mining, association rule mining, text mining, evaluation, privacy-preserving, terrorism, law enforcement, criminal justice 1.


A Software Infrastructure for Research in Textual Data Mining.
Few tools exist that address the challenges facing researchers in the Textual Data Mining (TDM) field. Some are too specific to their application, or are prototypes not suitable for general use. More general tools often are not capable of processing large volumes of data.
A Software Infrastructure for Research in Textual Data Mining.
Few tools exist that address the challenges facing researchers in the Textual Data Mining (TDM) field. Some are too specific to their application, or are prototypes not suitable for general use. More general tools often are not capable of processing large volumes of data.
A Semi%2Dsupervised Algorithm for Pattern Discovery in Information Extraction from Textual Data.
In this article we present a semi-supervised algorithm for pattern discovery  in information extraction from textual data. The patterns that are discovered  take the form of regular expressions that generate regular languages. We  term our approach `semi-supervised&#039; because it requires significantly less effort  to develop a training set than other approaches. From the training data our algorithm  automatically generates regular expressions that can be used on previously  unseen data for information extraction. Our experiments show that the algorithm  has good testing performance on many features that are important in the fight  against terrorism.
Massively Parallel Distributed Feature Extraction in Textual Data Mining Using HDDI%28tm%29.
data is feature extraction. The widespread digitization of information has created a wealth of data that requires novel approaches to feature extraction in a distributed environment. We propose a massively parallel model for feature extraction that employs unused cycles on networks of PCs/workstations in a highly distributed environment. We have developed an analytical model of the time and communication complexity of the feature extraction process in this environment based on feature extraction algorithms developed in our textual data mining research with [1] [18] [20]. We show that speedups linear in the number of processors are achievable for applications involving reduction operations based on a novel, parallel pipelined model of execution. We are in the process of validating our analytical model with empirical observations based on the extraction of features from a large number of pages on the World Wide Web.
CIMEL constructive%2C collaborative inquiry%2Dbased multimedia E%2Dlearning.
We describe a demonstration tool for teaching assistants, a synchronous/different place groupware application developed to encourage students to interact with instructors and TA&#039;s through computer networks. In a real-time remotecontrolled &#034;show me&#034; session, a TA can guide a student, step by step, by using an application sharing program and can annotate directly on a student&#039;s interface. Besides the live connection, students can review a FAQ database containing recorded &#034;show me&#034; videos. Other tools, like instant message delivery and &#034;chat&#034; room, are available to facilitate the demonstration.
Automatic Subject Indexing Using an Associative Neural Network.
The global growth in popularity of the World Wide Web has been enabled in part by the availability of browser based search tools which in turn have led to an increased demand for indexing techniques and technologies. As the amount of globally accessible information in community repositories grows, it is no longer cost-effective for such repositories to be indexed by professional indexers who have been trained to be consistent in subject assignment from controlled vocabulary lists. The era of amateur indexers is thus upon us, and the information infrastructure needs to provide support for such indexing if search of the Net is to produce useful results. In this paper
The Role of Associativity and Commutativity in the Detection and Transformation of Loop%2Dlevel Parallelism.
The study of theoretical and practical issues in automatic parallelization across application and language boundaries is an appropriate and timely task. In this paper, we discuss theory and techniques that wehave determined useful in parallelizing recurrences and reductions in computer programs. We present a framework for understanding such parallelism based on an approachwhich models loop bodies as coalescing loop operators. Within this framework we distinguish between associative coalescing loop operators and associative and commutative coalescing loop operators. We present the result of the application of this theory in a case study of a modern C++ semantic retrieval application drawn from the digital library field.
Restructuring Programs for High%2DSpeed Computers with Polaris.
The ability to automatically parallelize standard programming languages results in program portability across a wide range of machine architectures. It is the goal of the Polaris project to develop a new parallelizing compiler that overcomes limitations of current compilers. While current parallelizing compilers may succeed on small kernels, they often fail to extract any meaningful parallelism from whole applications. After a study of application codes, it was concluded that by adding a few new techniques to current compilers, automatic parallelization becomes feasible for a range of whole applications. The techniques needed are interprocedural analysis, scalar and array privatization, symbolic dependence analysis, and advanced induction and reduction recognition and elimination, along with run-time techniques to permit the parallelization of loops with unknown dependence relations.
Parallel Programming with Polaris.
. This paper proposes solutions to two important problems with parallel programming environments that were not previously addressed. The first issue is that current compilers are typically black-box tools with which the user has little interaction. Information gathered by the compiler, although potentially very meaningful for the user, is often inaccessible or hard to decipher. Second, compilation and performance analysis tools are not well integrated. While there are many advanced instruments for gathering and browsing performance results of a program, it is difficult to relate this information to the source program, to the applied program transformations, and to the compiler&#039;s reasoning. The Ursa Minor tool addresses these issues. The tool is designed to help understand the structure of a program and the information gathered by a compiler in an interactive way. It facilitates the comparison of performance results under different environments and the identification of potential parall...
Idiom Recognition in the Polaris Parallelizing Compiler.
The elimination of induction variables and the parallelization of reductions in FORTRAN programs have been shown to be integral to performance improvement on parallel computers [7, 8]. As part of the Polaris project [5], compiler passes that recognize these idioms have been implemented and evaluated. Developing these techniques to the point necessary to achieve significant speedups on real applications has prompted solutions to problems that have not been addressed in previous reports on idiom recognition techniques. These include analysis techniques capable of disproving zero-trip loops, symbolic handling facilities to compute closed forms of recurrences, and interfaces to other compilation passes such as the data-dependence test. In comparison, the recognition phase of solving induction variables, which has received most attention so far, has in fact turned out to be relatively straightforward. This paper provides an overview of techniques described in more detail in [12].
Polaris Improving the Effectiveness of Parallelizing Compilers.
It is the goal of the Polaris project to develop a new parallelizing compiler that will  overcome limitations of current compilers. While current parallelizing compilers may succeed on  small kernels, they often fail to extract any meaningful parallelism from large applications. After  a study of application codes, it was concluded that by adding a few new techniques to current  compilers, automatic parallelization becomes possible. The techniques needed are interprocedural  analysis, scalar and array privatization, symbolic dependence analysis, and advanced induction and  reduction recognition and elimination, along with run-time techniques to allow data dependent  behavior.
